Shattering-Extremal Set Systems of VC Dimension at most 2
نویسندگان
چکیده
We say that a set system F ⊆ 2[n] shatters a given set S ⊆ [n] if 2S = {F ∩ S : F ∈ F}. The Sauer inequality states that in general, a set system F shatters at least |F| sets. Here we concentrate on the case of equality. A set system is called shattering-extremal if it shatters exactly |F| sets. In this paper we characterize shattering-extremal set systems of Vapnik-Chervonenkis dimension 2 in terms of their inclusion graphs, and as a corollary we answer an open question about leaving out elements from shattering-extremal set systems in the case of families of Vapnik-Chervonenkis dimension 2.
منابع مشابه
Shattering-Extremal Systems
The Shatters relation and the VC dimension have been investigated since the early seventies. These concepts have found numerous applications in statistics, combinatorics, learning theory and computational geometry. Shattering extremal systems are set-systems with a very rich structure and many different characterizations. The goal of this thesis is to elaborate on the structure of these systems.
متن کاملShattering, Graph Orientations, and Connectivity
We present a connection between two seemingly disparate fields: VC-theory and graph theory. This connection yields natural correspondences between fundamental concepts in VC-theory, such as shattering and VC-dimension, and well-studied concepts of graph theory related to connectivity, combinatorial optimization, forbidden subgraphs, and others. In one direction, we use this connection to derive...
متن کاملShattering-extremal set systems from Sperner families
We say that a set system F ⊆ 2 shatters a given set S ⊆ [n] if 2 = {F ∩ S : F ∈ F}. The Sauer-Shelah lemma states that in general, a set system F shatters at least |F| sets. Here we concentrate on the case of equality. A set system is called shattering-extremal if it shatters exactly |F| sets. A conjecture of Rónyai and the second author and of Litman and Moran states that if a family is shatte...
متن کاملLeanability with VC-dimensions
By the above definitions we know, ΠF (n) ≤ |F| ΠF (n) ≤ |2| Definition 1.2 (Shattering). A hypothesis class F shatters a finite set S ⊂ X , iff |SF (S)| = 2|S| In an informal language, shattering means that you have to be able to separate all +/labelings of the same set of points, given the function class. We want to bound Rademacher average using a function of VC-dimension. Lemma 1.1. Let F be...
متن کاملSet Systems and Families of Permutations with Small Traces
We study the maximum size of a set system on n elements whose trace on any b elements has size at most k. This question extends to hypergraphs the classical Dirac-type problems from extremal graph theory. We show that if for some b ≥ i ≥ 0 the shatter function fR of a set system ([n], R) satisfies fR(b) < 2 (b − i + 1) then |R| = O(n); this generalizes Sauer’s Lemma on the size of set systems w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014